Numerical behavior of LP algorithms based upon the decomposition principle
نویسندگان
چکیده
منابع مشابه
Numerical behavior of the moment based estimation algorithms
Moments based estimation methods give a possible solution to those problems whose direct distribution analysis is infeasible. In this paper we compare the numerical properties of 3 moments based estimation methods. The estimation methods differ in the support interval of the estimated distribution. We consider infinite support, lower bounded support and finite support.
متن کاملThe Decomposition Principle and Algorithms for Linear Programming
The computational difficulties that continue to plague decomposition algorithms, namely, “long-tail” convergence and numerical instabilities, have served to dampen enthusiasm about their computational effectiveness. The use of interior points of subproblems in decomposition procedures may have a significant role to play in alleviating such computational difficulties. Indeed, Dantzig-Wolfe decom...
متن کاملA Unified Approach for Design of Lp Polynomial Algorithms
By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...
متن کاملCS 787 : Advanced Algorithms LP - Based Approximations
We present methods for constructing approximation algorithms to NP-hard optimization problems using linear programming (LP). We typically obtain an LP relaxation of the problem by formulating it as an integer linear program and dropping the integrality constraints. We then solve the LP relaxation exactly, and apply various rounding strategies (including randomized rounding and iterative roundin...
متن کاملLP-branching algorithms based on biased graphs
We give a combinatorial condition for the existence of efficient, LP-based FPT algorithms for a broad class of graph-theoretical optimisation problems. Our condition is based on the notion of biased graphs known from matroid theory. Specifically, we show that given a biased graph Ψ = (G,B), where B is a class of balanced cycles in G, the problem of finding a set X of at most k vertices in G whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1984
ISSN: 0024-3795
DOI: 10.1016/0024-3795(84)90186-1